Min-max-min Robust Combinatorial Optimization Subject to Discrete Uncertainty
نویسندگان
چکیده
We consider combinatorial optimization problems with uncertain objective functions. In the min-max-min robust optimization approach, a fixed number k of feasible solutions is computed such that the respective best of them is optimal in the worst case. The idea is to calculate a set of candidate solutions in a potentially expensive preprocessing and then select the best solution out of this set in real-time, once the actual scenario is known. In this paper, we investigate the complexity of this min-max-min problem in the case of discrete uncertainty, as well as its connection to the classical min-max robust counterpart. Essentially, it turns out that the min-max-min problem is not harder to solve than the min-max problem, while producing much better solutions in general.
منابع مشابه
Robust Combinatorial Optimization under Budgeted-Ellipsoidal Uncertainty∗
In the field of robust optimization uncertain data is modeled by uncertainty sets, i.e. sets which contain all relevant outcomes of the uncertain parameters. The complexity of the related robust problem depends strongly on the shape of the uncertainty set. Two popular classes of uncertainty are budgeted uncertainty and ellipsoidal uncertainty. In this paper we introduce a new uncertainty class ...
متن کاملMin-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions
In the classical min-max approach to robust combinatorial optimization, a single feasible solution is computed that optimizes the worst case over a given set of considered scenarios. As is well known, this approach is very conservative, leading to solutions that in the average case are far from being optimal. In this paper, we present a different approach: the objective is to compute k feasible...
متن کاملMin-max-min robust combinatorial optimization
The idea of k-adaptability in two-stage robust optimization is to calculate a fixed number k of second-stage policies here-and-now. After the actual scenario is revealed, the best of these policies is selected. This idea leads to a min-max-min problem. In this paper, we consider the case where no first stage variables exist and propose to use this approach to solve combinatorial optimization pr...
متن کاملOn Scenario Aggregation to Approximate Robust Combinatorial Optimization Problems
As most robust combinatorial min-max and min-max regret problems with discrete uncertainty sets are NP-hard, research in approximation algorithm and approximability bounds has been a fruitful area of recent work. A simple and well-known approximation algorithm is the midpoint method, where one takes the average over all scenarios, and solves a problem of nominal type. Despite its simplicity, th...
متن کاملA Lagrangean Decomposition Approach for Robust Combinatorial Optimization
We address robust versions of combinatorial optimization problems, specializing on the discrete scenario case and the uncorrelated ellipsoidal uncertainty case. We present a branch and bound-algorithm for the min-max variant of these problems which uses lower bounds obtained from Lagrangean decomposition, allowing to separate the uncertainty aspect in the objective function from the combinatori...
متن کامل